Hybrid Honey Bees Mating Optimization Algorithm for Identifying the Near-Optimal Solution in Web Service Composition

This paper addresses the problem of optimality in semantic Web service composition by proposing a hybrid nature-inspired method for selecting the optimal or near-optimal solution in semantic Web Service Composition. The method hybridizes the Honey-Bees Mating Optimization algorithm with components inspired from genetic algorithms, reinforcement learning, and tabu search. To prove the necessity of hybridization, we have analyzed comparatively the experimental results provided by our hybrid selection algorithm versus the ones obtained with the classical Honey Bees Mating Optimization algorithm and with the genetic-inspired algorithm of Canfora et al

Social Factors in P2P Energy Trading Using Hedonic Games

Lately, the energy communities have gained a lot of attention as they have the potential to significantly contribute to the resilience and flexibility of the energy system, facilitating widespread integration of intermittent renewable energy sources. Within these communities the prosumers can engage in peer-to-peer trading, fostering local collaborations and increasing awareness about energy usage and flexible consumption. However, even under these favorable conditions, prosumer engagement levels remain low, requiring trading mechanisms that are aligned with their social values and expectations. In this paper, we introduce an innovative hedonic game coordination and cooperation model for P2P energy trading among prosumers which considers the social relationships within an energy community to create energy coalitions and facilitate energy transactions among them. We defined a heuristic that optimizes the prosumers coalitions, considering their social and energy price preferences and balancing the energy demand and supply within the community. We integrated the proposed hedonic game model into a state-of-the-art blockchain-based P2P energy flexibility market and evaluated its performance within an energy community of prosumers. The evaluation results on a blockchain-based P2P energy flexibility market show the effectiveness in considering social factors when creating coalitions, increasing the total amount of energy transacted in a market session by 5% compared with other game theory-based solutions. Finally, it shows the importance of the social dimensions of P2P energy transactions, the positive social dynamics in the energy community increasing the amount of energy transacted by more than 10% while contributing to a more balanced energy demand and supply within the community.Comment: to be submitted to journa

Exploring the Selection of the Optimal Web Service Composition through Ant Colony Optimization

This paper presents an ant-inspired method for selecting the optimal or a near optimal solution in semantic Web service composition. The proposed method adapts and enhances the Ant Colony Optimization meta-heuristic and considers as selection criteria the QoS attributes of the services involved in the composition as well as the semantic similarity between them. To improve the performance of the proposed selection method a 1-OPT heuristic is defined which expands the search space in a controlled way so as to avoid the stagnation on local optimal solutions. The ant-inspired selection method has been evaluated on a set of scenarios having different complexities and comparatively analyzed with a cuckoo-inspired and a bee-inspired selection method

Deep Learning, Mining, and Collaborative Clustering to Identify Flexible Daily Activities Patterns

The monitoring of the daily life activities routine is beneficial, especially in old age. It can provide relevant information on the person’s health state and wellbeing and can help identify deviations that signal care deterioration or incidents that require intervention. Existing approaches consider the daily routine as a rather strict sequence of activities which is not usually the case. In this paper, we propose a solution to identify flexible daily routines of older adults considering variations related to the order of activities and activities timespan. It combines the Gap-BIDE algorithm with a collaborative clustering technique. The Gap-BIDE algorithm is used to identify the most common patterns of behavior considering the elements of variations in activities sequence and the period of the day (i.e., night, morning, afternoon, and evening) for increased pattern mining flexibility. K-means and Hierarchical Clustering Agglomerative algorithms are collaboratively used to address the time-related elements of variability in daily routine like activities timespan vectors. A prototype was developed to monitor and detect the daily living activities based on smartwatch data using a deep learning architecture and the InceptionTime model, for which the highest accuracy was obtained. The results obtained are showing that the proposed solution can successfully identify the routines considering the aspects of flexibility such as activity sequences, optional and compulsory activities, timespan, and start and end time. The best results were obtained for the collaborative clustering solution that considers flexibility aspects in routine identification, providing coverage of monitored data of 89.63%

Identification of Daily Living Recurrent Behavioral Patterns Using Genetic Algorithms for Elderly Care

A person’s routine is a sequence of activities of daily living patterns recurrently performed. Sticking daily routines is a great tool to support the care of persons with dementia, and older adults in general, who are living in their homes, and also being useful for caregivers. As state-of-the-art tools based on self-reporting are subjective and rely on a person’s memory, new tools are needed for objectively detecting such routines from the monitored data coming from wearables or smart home sensors. In this paper, we propose a solution for detecting the daily routines of a person by extracting the sequences of recurrent activities and their duration from the monitored data. A genetic algorithm is defined to extract activity patterns featuring small differences that relate to the day-to-day contextual variations that occur in a person’s daily routine. The quality of the solutions is evaluated with a probabilistic-based fitness function, while a tournament-based strategy is employed for the dynamic selection of mutation and crossover operators applied for generating the offspring. The time variability of activities of daily living is addressed using the dispersion of the values of duration of that activity around the average value. The results are showing an accuracy above 80% in detecting the routines, while the optimal values of population size and the number of generations for fitness function evolution and convergence are determined using multiple linear regression analysis

Identification of Daily Living Recurrent Behavioral Patterns Using Genetic Algorithms for Elderly Care

A person’s routine is a sequence of activities of daily living patterns recurrently performed. Sticking daily routines is a great tool to support the care of persons with dementia, and older adults in general, who are living in their homes, and also being useful for caregivers. As state-of-the-art tools based on self-reporting are subjective and rely on a person’s memory, new tools are needed for objectively detecting such routines from the monitored data coming from wearables or smart home sensors. In this paper, we propose a solution for detecting the daily routines of a person by extracting the sequences of recurrent activities and their duration from the monitored data. A genetic algorithm is defined to extract activity patterns featuring small differences that relate to the day-to-day contextual variations that occur in a person’s daily routine. The quality of the solutions is evaluated with a probabilistic-based fitness function, while a tournament-based strategy is employed for the dynamic selection of mutation and crossover operators applied for generating the offspring. The time variability of activities of daily living is addressed using the dispersion of the values of duration of that activity around the average value. The results are showing an accuracy above 80% in detecting the routines, while the optimal values of population size and the number of generations for fitness function evolution and convergence are determined using multiple linear regression analysis

Identifying and Monitoring the Daily Routine of Seniors Living at Home

As the population in the Western world is rapidly aging, the remote monitoring solutions integrated into the living environment of seniors have the potential to reduce the care burden helping them to self-manage problems associated with old age. The daily routine is considered a useful tool for addressing age-related problems having additional benefits for seniors like reduced stress and anxiety, increased feeling of safety and security. In this paper, we propose a solution for identifying the daily routines of seniors using the monitored activities of daily living and for inferring deviations from the routines that may require caregivers’ interventions. A Markov model-based method is defined to identify the daily routines, while entropy rate and cosine functions are used to measure and assess the similarity between the daily monitored activities in a day and the inferred routine. A distributed monitoring system was developed that uses Beacons and trilateration techniques for monitoring the activities of older adults. The results are promising, the proposed techniques can identify the daily routines with confidence concerning the activity duration of 0.98 and the sequence of activities in the interval of [0.0794, 0.0829]. Regarding deviation identification, our method obtains 0.88 as the best sensitivity value with an average precision of 0.95